Probabilities of 2-Xor Functions
نویسندگان
چکیده
The problem 2-Xor-Sat asks for the probability that a random expression, built as a conjunction of clauses x ⊕ y, is satisfiable. We consider here a refinement of this question, namely the probability that a random expression computes a specific Boolean function. The answer involves a description of 2-Xor expressions as multigraphs, and uses classical methods of analytic combinatorics.
منابع مشابه
A Self-organized Multi Agent Decision Making System Based on Fuzzy Probabilities: The Case of Aphasia Diagnosis
Aphasia diagnosis is a challenging medical diagnostic task due to the linguistic uncertainty and vagueness, large number of measurements with imprecision, inconsistencies in the definition of Aphasic syndromes, natural diversity and subjectivity in test objects as well as in options of experts who diagnose the disease. In this paper we present a new self-organized multi agent system that diagno...
متن کاملChanging probabilities of differentials and linear sums via isomorphisms of ciphers
Ciphers y = C(x, k) and = (, ) are isomorphic if there exists invertible computable in both directions map y ↔ , x ↔ , k ↔ . Cipher is vulnerable if and only if isomorphic cipher is vulnerable. Instead of computing the key of a cipher it is sufficient to find suitable isomorphic cipher and compute its key. If φ is arbitrary substitution and T is round substitution, its conjugate = φTφ...
متن کاملDual polynomials and communication complexity of XOR functions
We show a new duality between the polynomial margin complexity of f and the discrepancy of the function f ◦XOR, called an XOR function. Using this duality, we develop polynomial based techniques for understanding the bounded error (BPP) and the weakly-unbounded error (PP) communication complexities of XOR functions. This enables us to show the following. • A weak form of an interesting conjectu...
متن کاملDual polynomials and communication complexity of $\textsf{XOR}$ functions
We show a new duality between the polynomial margin complexity of f and the discrepancy of the function f ◦XOR, called an XOR function. Using this duality, we develop polynomial based techniques for understanding the bounded error (BPP) and the weakly-unbounded error (PP) communication complexities of XOR functions. This enables us to show the following. • A weak form of an interesting conjectu...
متن کاملCommunication Complexities of XOR functions
We call F : {0, 1}n×{0, 1}n → {0, 1} a symmetric XOR function if for a function S : {0, 1, ..., n} → {0, 1}, F (x, y) = S(|x⊕ y|), for any x, y ∈ {0, 1}n, where |x⊕ y| is the Hamming weight of the bit-wise XOR of x and y. We show that for any such function, (a) the deterministic communication complexity is always Θ(n) except for four simple functions that have a constant complexity, and (b) up ...
متن کامل